Second largest eigenpair statistics for sparse graphs
نویسندگان
چکیده
منابع مشابه
The Largest Eigenvalue Of Sparse Random Graphs
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely: λ1(G) = (1 + o(1))max{ √ ∆, np}, where ∆ is a maximal degree of G, and the o(1) term tends to zero as max{ √ ∆, np} tends to infinity.
متن کاملLargest sparse subgraphs of random graphs
For the Erdős-Rényi random graph Gn,p, we give a precise asymptotic formula for the size α̂t(Gn,p) of a largest vertex subset inGn,p that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t = t(n) is not too large. In the case of fixed t and p, we find that this value is asymptotically almost surely concentrated on at most two explicitly given points. ...
متن کاملGraphs with small second largest Laplacian eigenvalue
Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l . = 3.2470 is the largest root of the equation μ3 − 5μ2 + 6μ − 1 = 0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three. © 2013 Elsevier Ltd. All rights rese...
متن کاملModular Statistics for Subgraph Counts in Sparse Random Graphs
Answering a question of Kolaitis and Kopparty, we show that, for given integer q > 1 and pairwise nonisomorphic connected graphs G1, . . . , Gk, if p = p(n) is such that Pr(Gn,p ⊇ Gi) → 1 ∀i, then, with ξi the number of copies of Gi in Gn,p, (ξ1, . . . , ξk) is asymptotically uniformly distributed on Z k q .
متن کاملSpectral Characterization of Graphs with Small Second Largest Laplacian Eigenvalue
The family G of connected graphs with second largest Laplacian eigenvalue at most θ, where θ = 3.2470 is the largest root of the equation μ−5μ+6μ−1 = 0, is characterized by Wu, Yu and Shu [Y.R. Wu, G.L. Yu and J.L. Shu, Graphs with small second largest Laplacian eigenvalue, European J. Combin. 36 (2014) 190–197]. Let G(a, b, c, d) be a graph with order n = 2a + b + 2c + 3d + 1 that consists of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2020
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8121/abcbad